Single-machine bicriteria scheduling
نویسندگان
چکیده
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version and the galley proof are versions of the publication after peer review. • The final published version features the final layout of the paper including the volume, issue and page numbers.
منابع مشابه
Minimizing total completion time and maximum cost simultaneously is solvable in polynomial time
We prove that the bicriteria single-machine scheduling problem of minimizing total completion time and maximum cost simultaneously is solvable in polynomial time. Our result settles a long-standing open problem.
متن کاملBicriteria models to minimize the total weighted number of tardy jobs with convex controllable processing times and common due date assignment
We study a single-machine scheduling problem in a flexible framework where both job processing times and due dates are decision variables to be determined by the scheduler. The model can also be applied for quoting delivery times when some parts of the jobs may be outsourced. We analyze the problem with common due date assignment and a convex resource consumption function. We provide a bicriter...
متن کاملSingle Machine Scheduling with Controllable Processing Times by submodular Optimization
In scheduling with controllable processing times the actual processing time of each job is to be chosen from the interval between the smallest (compressed or fully crashed) value and the largest (decompressed or uncrashed) value. In the problems under consideration, the jobs are processed on a single machine and the quality of a schedule is measured by two functions: the maximum cost (that depe...
متن کاملNew solution methods for single machine bicriteria scheduling problem: Minimization of average flowtime and number of tardy jobs
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is important in practice, as the former criterion conveys the customer’s position, and the latter reflects the manufacturer’s perspective in the supply chain. We propose four new heuristics to solve this multiobjective schedul...
متن کاملSingle-machine scheduling considering carryover sequence-dependent setup time, and earliness and tardiness penalties of production
Production scheduling is one of the very important problems that industry and production are confronted with it. Production scheduling is often planned in the industrial environments while productivity in production can improve significantly the expansion of simultaneous optimization of the scheduling plan. Production scheduling and production are two areas that have attracted much attention in...
متن کاملA two machine bicriteria scheduling problem
In this paper we consider the bicriteria problem of scheduling n jobs on two parallel machines to minimize the primary criterion of maximum tardiness (1 .!9 ) and the secondary criterion of number of tardy jobs (NT). Algorithms are developed to optimize each of these criteria. Some properties on which the 1 .!9 algorithm is based are developed. Computational experience with the algorithms is al...
متن کامل